Resequencing with parallel queues to minimize the maximum number of items in the overflow area

This article treats an elementary optimization problem, where an inbound stream of successive items is to be resequenced with the help of multiple parallel queues in order to restore an intended target sequence. Whenever early items block the one item to be currently released into the target sequence, they are withdrawn from their queue and intermediately stored in an overflow area until their actual release is reached. We aim to minimize the maximum number of items simultaneously stored in the overflow area during the complete resequencing process. We met this problem in industry practice at a large German automobile producer, who has to resequence containers with car seats prior to the assembly process. We formalize the resulting resequencing problem and provide suited exact and heuristic solution algorithms. In our computational study, we also address managerial aspects such as how to properly avoid the negative effects of sequence alterations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 401–415, 2016     

A decomposition heuristic for the twin robots scheduling problem

This article provides an efficient heuristic based on decomposition for the twin robots scheduling problem (TRSP). TRSP concerns two moving robots executing storage and retrieval requests in parallel along a shared pathway. The depots are located at both ends of the line and a dedicated robot is assigned to each of them. While moving goods between their respective depots and some storage locations on the line, noncrossing constraints among robots need to be considered. Our heuristic uses a dynamic programming framework to determine the schedule of one robot while keeping the other one's fixed. It finds near‐optimal solutions even for large problem instances with hundreds of jobs in a short time span. © 2014 Wiley Periodicals, Inc. 62:16–22, 2015     

MODELS OF MILITARY EXPENDITURE AND GROWTH: A CRITICAL REVIEW

This paper reviews some of the theoretical and econometric issues involved in estimating growth models that include military spending. While the mainstream growth literature has not found military expenditure to be a significant determinant of growth, much of the defence economics literature has found significant effects. The paper argues that this is largely the product of the particular specification, the Feder–Ram model, that has been used in the defence economics literature but not in the mainstream literature. The paper critically evaluates this model, detailing its problems and limitations and suggests that it should be avoided. It also critically evaluates two alternative theoretical approaches, the Augmented Solow and the Barro models, suggesting that they provide a more promising avenue for future research. It concludes with some general comments about modelling the links between military expenditure and growth.